Boosting Graph Embedding on a Single GPU

نویسندگان

چکیده

Graphs are ubiquitous, and they can model unique characteristics complex relations of real-life systems. Although using machine learning (ML) on graphs is promising, their raw representation not suitable for ML algorithms. Graph embedding represents each node a graph as d-dimensional vector which more tasks. However, the process expensive, CPU-based tools do scale to real-world graphs. In this work, we present GOSH, GPU-based tool large-scale with minimum hardware constraints. GOSH employs novel coarsening algorithm enhance impact updates minimize work embedding. It also incorporates decomposition schema that enables any arbitrarily large be embedded single GPU. As result, sets new state-of-the-art in link prediction both accuracy speed, delivers high-quality embeddings classification at fraction time compared state-of-the-art. For instance, it embed over 65 million vertices 1.8 billion edges less than 30 minutes

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Simultaneous Graph Embedding

We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another where the mapping is not given. In particular, we show that without mapping, any number of outerplanar graphs can be embedded simultaneously on an O(n)×O(n) grid, and an outerplanar and general planar gra...

متن کامل

On-Line Planar Graph Embedding

We present a dynamic data structure for the incremental construction of a planar embedding of a planar graph. The data structure supports the following Ž . operations: i testing if a new edge can be added to the embedding without Ž . introducing crossing; and ii adding vertices and edges. The time complexity of Ž . Ž . each operation is O log n amortized for edge insertion , and the memory spac...

متن کامل

Graph Embedding

Some of the parameters used to analyze the efficiency of an embedding are dilation, expansion, edge congestion and wirelength. If e = (u, v) ∈E (G), then the length of Pf (e) in H is called the dilation of the edge e. The maximal dilation over all edges of G is called the dilation of the embedding f. The dilation of embedding G into H is the minimum dilation taken over all embeddings f of G int...

متن کامل

Garaph: Efficient GPU-accelerated Graph Processing on a Single Machine with Balanced Replication

Recent advances in storage (e.g., DDR4, SSD, NVM) and accelerators (e.g., GPU, Xeon-Phi, FPGA) provide the opportunity to efficiently process large-scale graphs on a single machine. In this paper, we present Garaph, a GPU-accelerated graph processing system on a single machine with secondary storage as memory extension. Garaph is novel in three ways. First, Garaph proposes a vertex replication ...

متن کامل

Bipartite Graph Matching Computation on GPU

The Bipartite Graph Matching Problem is a well studied topic in Graph Theory. Such matching relates pairs of nodes from two distinct sets by selecting a subset of the graph edges connecting them. Each edge selected has no common node as its end points to any other edge within the subset. When the considered graph has huge sets of nodes and edges the sequential approaches are impractical, specia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems

سال: 2021

ISSN: ['1045-9219', '1558-2183', '2161-9883']

DOI: https://doi.org/10.1109/tpds.2021.3129617